Block Save Addition with Threshold LogicS

In this paper we investigate small depth linear threshold element networks for multi-operand addition. We consider depth-2 linear threshold element networks and block save addition. We improve the overall cost of the block save addition, both in terms of gates and wires (actually the number of gates each multiplied by its number of inputs), with the inclusion of the telescopic sums proposed by Minnick together with a minimization technique based on gates sharing. We show that previously proposed schemes require about twice the number of linear threshold gates for common operand lengths. Furthermore, we show that the number of wires required by an implementation for previously proposed schemes is also about two times higher than the number of wires required for the scheme we describe for commonly architected operand sizes.